package BinaryTreeLianXi;

public class Test {
    public static void main(String[] args) {
        BinaryTree binaryTree=new BinaryTree();
        BinaryTree.TreeNode root=binaryTree.createTree();
        binaryTree.preOrder(root);
        System.out.println();

        binaryTree.inOrder(root);
        System.out.println(binaryTree.inorderTraversal2(root));

        System.out.println();

        binaryTree.postorder(root);
        System.out.println(binaryTree.postorderTraversal2(root));

        System.out.println(binaryTree.size2(root));

        System.out.println(binaryTree.getLevelCount(root, 2));


        System.out.println("========");
        BinaryTree binaryTree2=new BinaryTree();
        binaryTree2.createTreeNode("ewe#r#y");
        binaryTree2.preOrder(root);
    }


}
